An Upper Limit of AC Huffman Code Length in JPEG Compression

نویسنده

  • Kenichi Horie
چکیده

A strategy for computing upper code-length limits of AC Huffman codes for an 8x8 block in JPEG Baseline coding is developed. The method is based on a geometric interpretation of the DCT, and the calculated limits are as close as 14% to the maximum code-lengths. The proposed strategy can be adapted to other transform coding methods, e.g., MPEG 2 and 4 video compressions, to calculate close upper code length limits for the respective processing blocks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Joint Source-Channel Decoding of JPEG Images using Error Resilient Source Codes

Iterative decoding of JPEG images does not perform well due to the poor distance property of the original JPEG Huffman codes. We propose a symmetric RVLC with large free distance which can dramatically improve the system performance when iterative decoding is performed. Simulation results indicate up to 4 dB coding gain is achievable. There is a significant body of literature (see references in...

متن کامل

Using Multiple Huffman Code Tables for Optimal Coding of DCT Blocks

It is a well-known observation that when a DCT block is traversed in zigzag order, the AC coefficients generally decrease in size and the run-length of zero coefficients increase in number. Therefore, use of a single AC Huffman code table in the JPEG baseline algorithm leads to sub-optimal coding, and it is desirable to use multiple code tables, one for each DCT coefficient position, if necessa...

متن کامل

Constructing Binary Huffman Tree1

Huffman coding is one of a most famous entropy encoding methods for lossless data compression [16]. JPEG and ZIP formats employ variants of Huffman encoding as lossless compression algorithms. Huffman coding is a bijective map from source letters into leaves of the Huffman tree constructed by the algorithm. In this article we formalize an algorithm constructing a binary code tree, Huffman tree.

متن کامل

Experiments with a Lossless JPEG Codec

The ISO JPEG Still Image Compression Standard is popularly known for its DCT-based compression technique, but its non-DCT based lossless mode of operation is less well known. Lossless JPEG uses a form of discrete pulse code modulation (DPCM) [3]. That is, a linear combination of a pixel’s left, upper and upper left neighbors is used to predict the pixel’s value, and the difference between the p...

متن کامل

University of Warsaw Faculty of Mathematics , Informatics and Mechanics Marek Biskup

In compressed data a single bit error propagates because of the corruption of the decoder’s state. This work is a study of error resilience in compressed data and, in particular, of the recovery of as much data as possible after a bit error. It is focused on Huffman codes. In a message encoded with a Huffman code a bit error causes the decoder to lose synchronization with the coder. The error p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0901.2954  شماره 

صفحات  -

تاریخ انتشار 2009